The type A Coxeter complex in algebraic combinatorics

ثبت نشده
چکیده

Coxeter complexes are simplicial polytopes derived from certain reflection groups. The type An−1 Coxeter complex is derived from the symmetric group Sn and admits an elegant combinatorial description. Its faces are identified with set compositions and certain combinatorial properties of these compositions can be explained geometrically. Aguiar and Mahajan used this geometry to define a product and coproduct on various vector spaces, thereby endowing them with the structure of a combinatorial Hopf algebra. This talk will be an overview of their work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Cluster Complexes and Coxeter Combinatorics

In the first part of this paper (Sections 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, and 12), we introduce and study a simplicial complex ∆(Φ) associated to a finite root system Φ and a nonnegative integer parameter m. For m = 1, our construction specializes to the (simplicial) generalized associahedra ∆(Φ) introduced in [13] and identified in [14] as the underlying complexes for the cluster algebras of f...

متن کامل

Geometric combinatorics of Weyl groupoids

We extend properties of the weak order on finite Coxeter groups to Weyl groupoids admitting a finite root system. In particular, we determine the topological structure of intervals with respect to weak order, and show that the set of morphisms with fixed target object forms an ortho-complemented meet semilattice. We define the Coxeter complex of a Weyl groupoid with finite root system and show ...

متن کامل

The combinatorics of frieze patterns and Markoff numbers

This article, based on joint work with Gabriel Carroll, Andy Itsara, Ian Le, Gregg Musiker, Gregory Price, Dylan Thurston, and Rui Viana, presents a combinatorial model based on perfect matchings that explains the symmetries of the numerical arrays that Conway and Coxeter dubbed frieze patterns. This matchings model is a combinatorial interpretation of Fomin and Zelevinsky’s cluster algebras of...

متن کامل

Brick Polytopes of Spherical Subword Complexes and Generalized Associahedra

We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster complexes of finite types. For the latter, the brick polytopes turn out to coincide with the known realizations of generalized associahedra, thus opening new perspec...

متن کامل

m at h . C O ] 1 4 A ug 2 00 5 BERGMAN COMPLEXES , COXETER ARRANGEMENTS , AND GRAPH ASSOCIAHEDRA

Tropical varieties play an important role in algebraic geometry. The Bergman complex B(M) and the positive Bergman complex B+(M) of an oriented matroid M generalize to matroids the notions of the tropical variety and positive tropical variety associated to a linear ideal. Our main result is that if A is a Coxeter arrangement of type Φ with corresponding oriented matroid MΦ, then B (MΦ) is dual ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011